Highly efficient sparse-matrix inversion techniques and average procedures applied to collisional-radiative codes
نویسندگان
چکیده
منابع مشابه
Data-Parallel Language for Correct and Efficient Sparse Matrix Codes
Data-Parallel Language for Correct and Efficient Sparse Matrix Codes by Gilad Arnold Doctor of Philosophy in Computer Science University of California, Berkeley Professor Rastislav Bodík, Chair Sparse matrix formats encode very large numerical matrices with relatively few nonzeros. They are typically implemented using imperative languages, with emphasis on low-level optimization. Such implement...
متن کاملSpectral techniques applied to sparse random graphs
We analyze the eigenvalue gap for the adjacency matrices of sparse random graphs. Let λ1 ≥ . . . ≥ λn be the eigenvalues of an n-vertex graph, and let λ = max[λ2, |λn|]. Let c be a large enough constant. For graphs of average degree d = c log n it is well known that λ1 ≥ d, and we show that λ = O( √ d). For d = c it is no longer true that λ = O( √ d), but we show that by removing a small number...
متن کاملA stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملHighly Parallel Sparse Matrix-Matrix Multiplication
Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on two-dimensional block distribution of sparse matrices where serial sections use a novel hyperspa...
متن کاملSparse matrix inversion with scaled Lasso
We propose a new method of learning a sparse nonnegative-definite target matrix. Our primary example of the target matrix is the inverse of a population covariance or correlation matrix. The algorithm first estimates each column of the target matrix by the scaled Lasso and then adjusts the matrix estimator to be symmetric. The penalty level of the scaled Lasso for each column is completely dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: High Energy Density Physics
سال: 2009
ISSN: 1574-1818
DOI: 10.1016/j.hedp.2009.03.012